280 research outputs found
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the τ-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees
Asynchronous distributed algorithms are a popular way to reduce
synchronization costs in large-scale optimization, and in particular for neural
network training. However, for nonsmooth and nonconvex objectives, few
convergence guarantees exist beyond cases where closed-form proximal operator
solutions are available. As most popular contemporary deep neural networks lead
to nonsmooth and nonconvex objectives, there is now a pressing need for such
convergence guarantees. In this paper, we analyze for the first time the
convergence of stochastic asynchronous optimization for this general class of
objectives. In particular, we focus on stochastic subgradient methods allowing
for block variable partitioning, where the shared-memory-based model is
asynchronously updated by concurrent processes. To this end, we first introduce
a probabilistic model which captures key features of real asynchronous
scheduling between concurrent processes; under this model, we establish
convergence with probability one to an invariant set for stochastic subgradient
methods with momentum.
From the practical perspective, one issue with the family of methods we
consider is that it is not efficiently supported by machine learning
frameworks, as they mostly focus on distributed data-parallel strategies. To
address this, we propose a new implementation strategy for shared-memory based
training of deep neural networks, whereby concurrent parameter servers are
utilized to train a partitioned but shared model in single- and multi-GPU
settings. Based on this implementation, we achieve on average 1.2x speed-up in
comparison to state-of-the-art training methods for popular image
classification tasks without compromising accuracy
Modeling and Design of Millimeter-Wave Networks for Highway Vehicular Communication
Connected and autonomous vehicles will play a pivotal role in future
Intelligent Transportation Systems (ITSs) and smart cities, in general.
High-speed and low-latency wireless communication links will allow
municipalities to warn vehicles against safety hazards, as well as support
cloud-driving solutions to drastically reduce traffic jams and air pollution.
To achieve these goals, vehicles need to be equipped with a wide range of
sensors generating and exchanging high rate data streams. Recently, millimeter
wave (mmWave) techniques have been introduced as a means of fulfilling such
high data rate requirements. In this paper, we model a highway communication
network and characterize its fundamental link budget metrics. In particular, we
specifically consider a network where vehicles are served by mmWave Base
Stations (BSs) deployed alongside the road. To evaluate our highway network, we
develop a new theoretical model that accounts for a typical scenario where
heavy vehicles (such as buses and lorries) in slow lanes obstruct Line-of-Sight
(LOS) paths of vehicles in fast lanes and, hence, act as blockages. Using tools
from stochastic geometry, we derive approximations for the
Signal-to-Interference-plus-Noise Ratio (SINR) outage probability, as well as
the probability that a user achieves a target communication rate (rate coverage
probability). Our analysis provides new design insights for mmWave highway
communication networks. In considered highway scenarios, we show that reducing
the horizontal beamwidth from to determines a minimal
reduction in the SINR outage probability (namely, at
maximum). Also, unlike bi-dimensional mmWave cellular networks, for small BS
densities (namely, one BS every m) it is still possible to achieve an
SINR outage probability smaller than .Comment: Accepted for publication in IEEE Transactions on Vehicular Technology
-- Connected Vehicles Serie
Secrecy Sum-Rates for Multi-User MIMO Regularized Channel Inversion Precoding
In this paper, we propose a linear precoder for the downlink of a multi-user
MIMO system with multiple users that potentially act as eavesdroppers. The
proposed precoder is based on regularized channel inversion (RCI) with a
regularization parameter and power allocation vector chosen in such a
way that the achievable secrecy sum-rate is maximized. We consider the
worst-case scenario for the multi-user MIMO system, where the transmitter
assumes users cooperate to eavesdrop on other users. We derive the achievable
secrecy sum-rate and obtain the closed-form expression for the optimal
regularization parameter of the precoder using
large-system analysis. We show that the RCI precoder with
outperforms several other linear precoding schemes, and
it achieves a secrecy sum-rate that has same scaling factor as the sum-rate
achieved by the optimum RCI precoder without secrecy requirements. We propose a
power allocation algorithm to maximize the secrecy sum-rate for fixed .
We then extend our algorithm to maximize the secrecy sum-rate by jointly
optimizing and the power allocation vector. The jointly optimized
precoder outperforms RCI with and equal power allocation
by up to 20 percent at practical values of the signal-to-noise ratio and for 4
users and 4 transmit antennas.Comment: IEEE Transactions on Communications, accepted for publicatio
Hybrid Mechanisms for On-Demand Transport
Peer reviewedPostprin
On Regular Schemes and Tight Frames
International audienceFinite frames are sequences of vectors in finite dimensional Hilbert spaces that play a key role in signal processing and coding theory. In this paper, we study the class of tight unit-norm frames for C d that also form regular schemes, called tight regular schemes (TRS). Many common frames that arise in applications such as equiangular tight frames and mutually unbiased bases fall in this class. We investigate characteristic properties of TRSs and prove that for many constructions, they are intimately connected to weighted 1-designs—arising from quadrature rules for integrals over spheres in Cd —with weights dependent on the Voronoi regions of each frame element. Aided by additional numerical evidence, we conjecture that all TRSs in fact satisfy this property
Dependence Testing via Extremes for Regularly Varying Models
International audienceIn heavy-tailed data, such as data drawn from regularly varying models, extreme values can occur relatively often. As a consequence, in the context of hypothesis testing, extreme values can provide valuable information in identifying dependence between two data sets. In this paper, the error exponent of a dependence test is studied when only processed data recording whether or not the value of the data exceeds a given value is available. An asymptotic approximation of the error exponent is obtained, establishing a link with the upper tail dependence, which is a key quantity in extreme value theory. While the upper tail dependence has been well characterized for elliptically distributed models, much less is known in the non-elliptical setting. To this end, a family of nonelliptical distributions with regularly varying tails arising from shot noise is studied, and an analytical expression for the upper tail dependence derived
- …